The partial non - combinatorially symmetric N 10 - matrix completion problem
نویسنده
چکیده
An n×n matrix is called an N 0 -matrix if all principal minors are non-positive and each entry is non-positive. In this paper, we study the partial non-combinatorially symmetric N 0 -matrix completion problems if the graph of its specified entries is a transitive tournament or a double cycle. In general, these digraphs do not have N 0 -completion. Therefore, we have given sufficient conditions that guarantee the existence of the N 0 -completion for these digraphs. Keywords—Matrix completion; Matrix completion; N 0 -matrix; Non-combinatorially symmetric; Cycle; Digraph.
منابع مشابه
The N 10 - Matrix Completion Problem
An n×n matrix is called an N1 0 -matrix if all its principal minors are non-positive and each entry is non-positive. In this paper, we study general combinatorially symmetric partial N1 0 -matrix completion problems and prove that a combinatorially symmetric partial N1 0 -matrix with all specified offdiagonal entries negative has an N1 0 -matrix completion if the graph of its specified entries ...
متن کاملcompletions on partial matrices ?
An n × n matrix is called an N0-matrix if all its principal minors are nonpositive. In this paper, we are interested in N0-matrix completion problems, that is, when a partial N0-matrix has an N0-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial N0-matrix does not have an N0-matrix completion. Here, we prove that a combinatorially symmetric partial N0-matr...
متن کاملof Linear Algebra . A publication of the International Linear
An n-by-n real matrix is called a P -matrix if all its principal minors are positive. The P -matrix completion problem asks which partial P -matrices have a completion to a P -matrix. Here, we prove that every partial P -matrix with combinatorially symmetric speci ed entries has a P -matrix completion. The general case, in which the combinatorial symmetry assumption is relaxed, is also discussed.
متن کاملRelationships between the Completion Problems for Various Classes of Matrices
where N = {1, . . . , n}. In this paper a pattern is assumed to include all diagonal positions. A symmetric pattern is a pattern with the property that (i, j) is in the pattern if and only if (j, i) is also in the pattern; symmetric patterns are also called positionally or combinatorially symmetric. An asymmetric pattern is a pattern with the property that if (i, j) is in the pattern, then (j, ...
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کامل